Multiobjective controller design by solving a multiobjective matrix inequality problem
نویسنده
چکیده
In this study, linear matrix inequality (LMI) approaches and multiobjective (MO) evolutionary algorithms are integrated to design controllers. An MO matrix inequality problem (MOMIP) is first defined. A hybrid MO differential evolution (HMODE) algorithm is then developed to solve the MOMIP. The hybrid algorithm combines deterministic and stochastic searching schemes. In the solving process, the deterministic part aims to exploit the structures of matrix inequalities, and the stochastic part is used to fully explore the decision variable space. Simulation results show that the HMODE algorithm can produce an approximated Pareto front (APF) and Pareto-efficient controllers that stabilize the associated controlled system. In contrast with single-objective designs using LMI approaches, the proposed MO methodology can clearly illustrate how the objectives involved affect each other, i.e., a broad perspective on optimality is provided. This facilitates the selecting process for a representative design, and particularly the design that corresponds to a nondominated vector lying in the knee region of the APF. In addition, controller gains can be readily modified to incorporate the preference or need of a system designer. W.-Y. Chiu is with the Multiobjective Control Lab, Department of Electrical Engineering, Yuan Ze University, Taoyuan 32003, Taiwan (email: [email protected]). This work was supported by the Ministry of Science and Technology of Taiwan under Grant 102-2218-E-155-004-MY3. This paper is a postprint of a paper submitted to and accepted for publication in IET Control Theory and Applications and is subject to Institution of Engineering and Technology Copyright. The copy of record is available at IET Digital Library. doi: 10.1049/iet-cta.2014.0026 May 8, 2017 DRAFT 2
منابع مشابه
A satisfactory strategy of multiobjective two person matrix games with fuzzy payoffs
The multiobjective two person matrix game problem with fuzzy payoffs is considered in this paper. It is assumed that fuzzy payoffs are triangular fuzzy numbers. The problem is converted to several multiobjective matrix game problems with interval payoffs by using the $alpha$-cuts of fuzzy payoffs. By solving these problems some $alpha$-Pareto optimal strategies with some interval outcomes are o...
متن کاملMethod of Inequality-Based Multiobjective Genetic Algorithm for Optimizing Cart-Double-Pendulum-System
This article presents a multiobjective genetic algorithm to tracking the optimal parameterization problem of the controller concerning the swinging-up and handstand-control of the general cart-doublependulum system (CDPS). The design based on the Human-Simulated Intelligent Control (HSIC) theory is required to meet various criteria according to the expected specifications. The proposed algorith...
متن کاملController Design Using Linear Matrix Inequalities
2.3. H∞ Performance 3. Controller Design Using Linear Matrix Inequalities 3.1. Linearizing Change of Variables – State Feedback 3.2. Linearizing Change of Variables Output Feedback 3.3. LMI Approach to Multiobjective Design 3.4. Existence of Solutions and Conservatism of Design 4. Illustrative Design Example: Robust Control of a Power System Stabilizer 4.1. Problem Description 4.2. Design Speci...
متن کاملMultiobjective PID control design in uncertain robotic systems using neural network elimination scheme
In this paper, a proportional-plus-integral derivative (PID)-type controller incorporating neural network elimination scheme and sliding-mode control action for different objectives including 2 tracking performance, tracking performance, and regional pole constraints is developed in robotic systems under plant uncertainties and external disturbances. The adaptive neural networks are used to com...
متن کاملMultiobjective security game with fuzzy payoffs
A multiobjective security game problem with fuzzy payoffs is studied in this paper. The problem is formulated as a bilevel programming problem with fuzzy coefficients. Using the idea of nearest interval approximation of fuzzy numbers, the problem is transformed into a bilevel programming problem with interval coefficients. The Karush-Kuhn-Tucker conditions is applied then to reduce the problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1705.02109 شماره
صفحات -
تاریخ انتشار 2017